Buffer allocation problem in production flow lines: A new Benders-decomposition-based exact solution approach

نویسندگان

چکیده

The Buffer Allocation Problem (BAP) in production flow lines is very relevant from a practical point of view and challenging scientific perspective. For this reason, it has drawn great attention both industry the academic community. However, despite problem’s relevance, no exact method available literature to solve when long are being considered, i.e., settings. This work proposes new Mixed-Integer Linear Programming (MILP) formulation for solution sample-based BAP. Due huge number variables constraints model, an algorithm based on Benders decomposition proposed increase computational efficiency. iterates between simulation module that generates cuts optimization involves updated MILP model. Multiple after each run generated by exploiting structural properties reversibility monotonicity line throughput. tighter than state-of-the-art model theoretical view, order magnitude computation time saving also observed numerical results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new Approach Versus Benders Decomposition in Aggregate Production Planning

This paper proposes a simplified solution procedure to the model presented by Akinc and Roodman. The Benders’ decomposition procedure for analyzing this model has been developed, and its shortcomings have been highlighted. Here, the special nature of the problem is exploited which allowed us to develop a new algorithm through surrogating method. The two methods are compared by several numerical...

متن کامل

Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition

We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capacity constraints, and the allocation of the customers to trucks at those facilities under per truck traveldistance constraints. We present a hybrid approach that combines integer programming and constraint programming using logic...

متن کامل

A Benders\' Decomposition Based Solution Method for Solving User Equilibrium Problem: Deterministic and Stochastic Cases

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

متن کامل

A New Algorithm for Buffer Allocation in Production Lines

In the paper a new efficient algorithm for the allocation of storage capacity in serial production lines is derived. The proposed method aims to find out the distribution of storage capacity between machines that minimizes the total buffer space assigned to the line satisfying a target production requirement. The algorithm relies on an iterative scheme that, starting from the minimal capacity r...

متن کامل

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IISE transactions

سال: 2021

ISSN: ['2472-5854', '2472-5862']

DOI: https://doi.org/10.1080/24725854.2021.1905195